منابع مشابه
Learning Nondeterministic Mealy Machines
In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of such systems can be inherently nondeterministic. To cope with this challenge, we developed an algorithm to infer nondeterministic computation models in the form of Mealy machines. We introduce our approach and provide extensive experimental results to assess its potentia...
متن کاملEfficient Inference of Mealy Machines
Automata learning is increasingly being applied to ease the testing and comparing of complex systems. We formally reconstruct an efficient algorithm for the inference of Mealy machines, prove its correctness, and show that equivalence queries are not required for nonminimal hypotheses. In fact, we are able to evade those by applying a minor optimization to the algorithm. As a corollary, standar...
متن کاملComputational Complementarity for Mealy Automata
In this paper we extend (and study) two computational comple-mentarity principles from Moore to Mealy automata which are nite machines possessing better \quantum-like" features. We conjecture that both computational complementarity principles are incompatible with Svozil's deenition of reversibility; experimental evidence is given in support.
متن کاملA Mealy Machine of Growth
We consider a very simple Mealy machine (three states over a twosymbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sid...
متن کاملLearning Mealy Machines with Timers
Active automata learning is emerging as an effective bug finding technique, with applications in areas such as banking cards, network protocols and legacy software. Timing often plays a crucial role in these applications, but cannot be handled by existing learning algorithms. Even though there has been significant progress on algorithms for active learning of timed models, these are not yet bro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: British Dental Journal
سال: 2007
ISSN: 0007-0610,1476-5373
DOI: 10.1038/bdj.2007.281